Discrete phase space based on finite fields
نویسندگان
چکیده
منابع مشابه
Discrete logarithms over finite fields
Discrete exponentiation in a finite field is a direct analog of ordinary exponentiation. The exponent can only be an integer, say n, but for w in a field F , w is defined except when w = 0 and n ≤ 0, and satisfies the usual properties, in particular w = ww and (for u and v in F ) (uv) = uv. The discrete logarithm is the inverse function, in analogy with the ordinary logarithm for real numbers. ...
متن کاملUnitary Evolution on a Discrete Phase Space
We construct unitary evolution operators on a phase space with power of two discretization. These operators realize the metaplectic representation of the modular group SL(2,Z2n). It acts in a natural way on the coordinates of the non-commutative 2-torus, T2n and thus is relevant for noncommutative field theories as well as theories of quantum space-time. The class of operators may also be usefu...
متن کاملContinuous phase-space methods on discrete phase spaces
We show that discrete quasiprobability distributions defined via the discrete Heisenberg-Weyl group can be obtained as discretizations of the continuous SU(N) quasiprobability distributions. This is done by identifying the phase-point operators with the continuous quantisation kernels evaluated at special points of the phase space. As an application we discuss the positive-P function and show t...
متن کاملEvaluation Report on the Discrete Logarithm Problem over finite fields
This document is an evaluation of the discrete logarithm problem over finite fields (DLP), as a basis for designing cryptographic schemes. It relies on the analysis of numerous research papers on the subject. The present report is organized as follows: firstly, we review the DLP and several related problems such as the Diffie-Hellman problem. Next, we analyze the various algorithms that are cur...
متن کاملDiscrete logarithms in curves over finite fields
The discrete logarithm problem in finite groups is one of the supposedly difficult problems at the foundation of asymmetric or public key cryptography. The first cryptosystems based on discrete logarithms were implemented in the multiplicative groups of finite fields, in which the discrete logarithm problem turned out to be easier than one would wish, just as the factorisation problem at the he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2004
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.70.062101